Bilevel Programming Approaches to the Computation of Optimistic and Pessimistic Single-Leader-Multi-Follower Equilibria
نویسندگان
چکیده
We study the problem of computing an equilibrium in leader-follower games with a single leader and multiple followers where, after the leader’s commitment to a mixed strategy, the followers play simultaneously in a noncooperative way, reaching a Nash equilibrium. We tackle the problem from a bilevel programming perspective. Since, given the leader’s strategy, the followers’ subgame may admit multiple Nash equilibria, we consider the cases where the followers play either the best (optimistic) or the worst (pessimistic) Nash equilibrium in terms of the leader’s utility. For the optimistic case, we propose three formulations which cast the problem into a single level mixedinteger nonconvex program. For the pessimistic case, which, as we show, may admit a supremum but not a maximum, we develop an ad hoc branch-and-bound algorithm. Computational results are reported and illustrated. 1998 ACM Subject Classification G.1.6 [Optimization] Nonlinear programming
منابع مشابه
A New Method For Solving Linear Bilevel Multi-Objective Multi-Follower Programming Problem
Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...
متن کاملMulti-follower linear bilevel programming: model and Kuhn-Tucker approach
The majority of research on bilevel programming has centered on the linear version of the problem in which only one leader and single follower are involved. This paper proposes a general model and Kuhn-Tucker approach for linear bilevel programming problems in which one leader and multiple follower(s) are involved, and there may (not) be sharing variables among the followers. Finally, a numeric...
متن کاملDecision Rule Bounds for Stochastic Bilevel Programs
We study stochastic bilevel programs where the leader chooses a binary here-and-now decision and the follower responds with a continuous wait-and-see-decision. Using modern decision rule approximations, we construct lower bounds on an optimistic version and upper bounds on a pessimistic version of the leader’s problem. Both bounding problems are equivalent to explicit mixedinteger linear progra...
متن کاملSimulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017